Modeling Opponents in Adversarial Risk Analysis

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adversarial risk analysis for counterterrorism modeling.

Recent large-scale terrorist attacks have raised interest in models for resource allocation against terrorist threats. The unifying theme in this area is the need to develop methods for the analysis of allocation decisions when risks stem from the intentional actions of intelligent adversaries. Most approaches to these problems have a game-theoretic flavor although there are also several intere...

متن کامل

Fast Learning against Adaptive Adversarial Opponents

The ability to learn and adapt when playing against an adaptive opponent requires the ability to predict the opponent’s behavior. Capturing any changes in the opponent’s behavior during a sequence of plays is critical to achieve positive outcomes in such an environment. We identify two new requirements that we suggest are essential for agents that learn in adaptive environments. These requireme...

متن کامل

When speed matters in learning against adversarial opponents

We propose a novel algorithm that is able to learn and adapt to an opponent even within a limited number of interactions and against a rapidly adapting opponent. The context we use is two player normal form games. We compare the performance of an agent using our algorithm against agents using existing multiagent learning algorithms.

متن کامل

Adversarial classification: An adversarial risk analysis approach

Classification problems in security settings are usually contemplated as confrontations in which one or more adversaries try to fool a classifier to obtain a benefit. Most approaches to such adversarial classification problems have focused on game theoretical ideas with strong underlying common knowledge assumptions, which are actually not realistic in security domains. We provide an alternativ...

متن کامل

Modeling non-stationary opponents

This paper studies repeated interactions between an agent and an unknown opponent that changes its strategy over time. We propose a framework for learning switching nonstationary strategies. The approach uses decision trees to learn the most up to date opponent’s strategy. Then, the agent’s strategy is computed by transforming the tree into a Markov Decision Process (MDP), whose solution dictat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Risk Analysis

سال: 2015

ISSN: 0272-4332

DOI: 10.1111/risa.12439